Burst-level congestion control using hindsight optimization

نویسندگان

  • Gang Wu
  • Edwin K. P. Chong
  • Robert Givan
چکیده

We consider the burst-level congestion control problem in a communication network with multiple traffic sources, modeled as infinite banks of fluid traffic. The controlled traffic shares a common bottleneck node with highpriority cross traffic modeled as Markov-modulated fluid. We introduce a simulation-based congestion control scheme capable of performing effectively under rapidly-varying service rate by making use of the stochastic model of the cross traffic. In the scheme, the control problem is posed as a finite-horizon Markov decision process and is solved heuristically using a technique called Hindsight Optimization. The goal is to maximize throughput minus scaled delay at the bottleneck node. Our empirical study shows that the control scheme performs significantly better than conventional congestion control methods. Keywords—communication networks, congestion control, traffic model, Markov-modulated fluid, Markov decision processes, simulation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Congestion Control via Online Sampling

We consider the congestion-control problem in a communication network with multiple traffic sources, each modeled as a fullycontrollable stream of fluid traffic. The controlled traffic shares a common bottleneck node with high-priority cross traffic described by a Markovmodulated fluid (MMF). Each controlled source is assumed to have a unique round-trip delay. We wish to maximize a linear combi...

متن کامل

A Framework for Simulation-based Network Control via Hindsight Optimization

We describe a novel approach for designing network control algorithms that incorporate traffic models. Traffic models can be viewed as stochastic predictions about the future network state, and can be used to generate traces of potential future network behavior. Our approach is to use such traces to heuristically evaluate candidate control actions using a technique called hindsight optimization...

متن کامل

A Joint Design of Congestion Control and Burst Contention Resolution for Optical Burst Switching Networks Citation

This paper revisits burst contention resolution problems in optical burst switching (OBS) networks from the viewpoint of network utility maximization. Burst collision occurs when two or more bursts access the same wavelength simultaneously, and the occurrence becomes more frequent as the offered load increases. In particular, when the network is overloaded, no contention resolution scheme would...

متن کامل

Application of Particle Swarm Optimization and Genetic Algorithm Techniques to Solve Bi-level Congestion Pricing Problems

The solutions used to solve bi-level congestion pricing problems are usually based on heuristic network optimization methods which may not be able to find the best solution for these type of problems. The application of meta-heuristic methods can be seen as viable alternative solutions but so far, it has not received enough attention by researchers in this field. Therefore, the objective of thi...

متن کامل

Using TCP congestion control to improve the performances of optical burst switched networks

We propose using a modified TCP decoupling approach as a congestion control mechanism for optical burst switched networks. The TCP decoupling approach [1] is a novel way that can apply TCP congestion control to any traffic flow (which can be an aggregate) in a network. Since this approach is generic, it has found applications in several areas [2, 3]. In the optical burst switching (OBS) area, b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Automat. Contr.

دوره 47  شماره 

صفحات  -

تاریخ انتشار 2002